Genetic Algorithms for Noisy Fitness Functions ― Applications, Requirements and Algorithms
نویسندگان
چکیده
منابع مشابه
Optimization of Noisy Fitness Functions by Means of Genetic Algorithms Using History of Search
This paper discusses optimization of functions with uncertainty by means of Genetic Algorithms (GAs). In practical application of such GAs, possible number of fitness evaluation is quite limited. The authors have proposed a GA utilizing history of search (Memory-based Fitness Evaluation GA: MFEGA) so as to reduce the number of fitness evaluation for such applications of GAs. However, it is also...
متن کاملAn Empirical Evaluation of Genetic Algorithms on Noisy Objective Functions
Genetic algorithms have particular potential as a tool for optimization when the evaluation function is noisy. Several types of genetic algorithm are compared against a mutation driven stochastic hill-climbing algorithm on a standard set of benchmark functions which have had Gaussian noise added to them. Diierent criteria for judging the eeectiveness of the search are also considered. The genet...
متن کاملGenetic Algorithms in Noisy Environments
Genetic Algorithms (GA) have been widely used in the areas of searching, function optimization, and machine learning. In many of these applications, the effect of noise is a critical factor in the performance of the genetic algorithms. While it hals been shown in previous siiudies that genetic algorithms are still able to perform effective121 in the presence of noise, tlhe problem of locating t...
متن کاملImproving Genetic Algorithms' Efficiency Using Intelligent Fitness Functions
Genetic Algorithms are an effective way to solve optimisation problems. If the fitness test takes a long time to perform then the Genetic Algorithm may take a long time to execute. Using conventional fitness functions Approximately a third of the time may be spent testing individuals that have already been tested. Intelligent Fitness Functions can be applied to improve the efficiency of the Gen...
متن کاملImproving performance of genetic algorithms by using novel fitness functions
This thesis introduces Intelligent Fitness Functions and Partial Fitness Functions both of which can improve the performance of a genetic algorithm which is limited to a fixed run time. An Intelligent Fitness Function is defined as a fitness function with a memory. The memory is used to store information about individuals so that duplicate individuals do not need to have their fitness tested. D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
سال: 2001
ISSN: 2188-4730,2188-4749
DOI: 10.5687/sss.2001.137